نتایج جستجو برای: Harary index
تعداد نتایج: 396366 فیلتر نتایج به سال:
Recently, a new molecular graph matrix, Harary matrix, was defined in honor of Professor Frank Harary, and new graph invariants (local and global) based on it were also defined and researched, Harary index is one of these invariants. The Harary matrix can be used to derive a variant of the Balaban index, Harary index was also successfully tested in several structure-property relationships, so i...
the harary index h can be viewed as a molecular structure descriptor composed of increments representing interactions between pairs of atoms, such that their magnitude decreases with the increasing distance between the respective two atoms. a generalization of the harary index, denoted by hk, is achieved by employing the steiner-type distance between k-tuples of atoms. we show that the linear c...
the emph{harary index} $h(g)$ of a connected graph $g$ is defined as $h(g)=sum_{u,vin v(g)}frac{1}{d_g(u,v)}$ where $d_g(u,v)$ is the distance between vertices $u$ and $v$ of $g$. the steiner distance in a graph, introduced by chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. for a connected graph $g$ of order at least $2$ and $ssubseteq v(g)$, th...
Abstract. In this paper Reverse Wiener index, Reverse Detour Wiener index, Reverse Circular Wiener index Reverse Harary index, Reverse Detour Harary index, Reverse Circular Harary index, Reverse Reciprocal Wiener index, Reverse Detour Reciprocal Wiener index, Reverse Circular Reciprocal Wiener index, Reverse Hyper Wiener index, Reverse, Detour Hyper Wiener index, Reverse Circular Hyper Wiener i...
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, the exact formulae for the Harary indices of tensor product G × Km0,m1,...,mr−1 and the strong product G⊠Km0,m1,...,mr−1 , whereKm0,m1,...,mr−1 is the complete multipartite graph with partite sets of sizes m0,m1, . . . ,mr−1 are obtained. Also upper bounds for th...
let $g$ be a connected graph, and let $d[g]$ denote the double graph of $g$. in this paper, we first derive closed-form formulas for different distance based topological indices for $d[g]$ in terms of that of $g$. finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید